Generating Simple Random Graphs with Prescribed Degree Distribution
نویسندگان
چکیده
منابع مشابه
Generating simple random graphs with prescribed degree distribution
Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution F are described and compared. Two methods are based on the so called configuration model with modifications ensuring a simple graph, one method is an extension of the classical Erdős-Rényi graph where the edge probabilities a...
متن کاملEfficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm suitable for practical use both because of its ability to generate very large graphs (efficiency) and because it is easy to implement (simplicity). We focus on a family of heuristics for which we introduce optimality c...
متن کاملGenerating stationary random graphs on Z with prescribed i.i.d. degrees
Let F be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set Z, so that the degrees of the vertices are i.i.d. random variables with distribution F . Focus is on an algorithm where, initially, a random number of “stubs” with distribution F is attached to each vertex. Each stub is then random...
متن کاملGeneration of Random Graphs with Prescribed Degree Sequences
The study of complex networks plays an increasingly important role in science. One common feature of complex networks is that they are large. Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs. Most practical use would require some property constraints on random graphs, usually with given degrees. There are several wa...
متن کاملImproving the Computational Efficiency of the Blitzstein-Diaconis Algorithm for Generating Random Graphs of Prescribed Degree
When generating a random graph, if more structure is desired than is given in the popular Erdős–Renyi model, one method is to generate a degree sequence first then create a graph with this degree sequence. Blitzstein and Diaconis[1] (among others) developed a sequential algorithm to create a random graph from a degree sequence. This algorithm is assured to always terminate in a graph with the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2006
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-006-9168-x